Centralisers of Formal Maps
نویسندگان
چکیده
We consider the formal maps in any finite dimension d with coefficients an integral domain K identity. Those invertible under composition form a group [inline-graphic 1i]. centraliser Cg of element g ∈ 1i] infinite order, tangent to identity If has order and is field characteristic zero, we show that contains isomorphic copy additive (K, +). positive characteristic, uncountable abelian subgroup. The proofs are quite different but connected by so-called sum functions.
منابع مشابه
Formal Homotopy Quantum Field Theories, II : Simplicial Formal Maps
Simplicial formal maps were introduced in the first paper of this series as a tool for studying Homotopy Quantum Field Theories with background a general homotopy 2-type. Here we continue their study, showing how a natural generalisation can handle much more general backgrounds. The question of the geometric interpretation of these formal maps is partially answered in terms of combinatorial bun...
متن کاملCentralisers of Involutions in Black Box Groups
We discuss basic structural properties of finite black box groups. A special emphasis is made on the use of centralisers of involutions in probabilistic recognition of black box groups. In particular, we suggest an algorithm for finding the p-core of a black box group of odd characteristic. This special role of involutions suggest that the theory of black box groups reproduces, at a non-determi...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Formal Concept Lattices as Semantic Maps
In this paper, we present an application for formal concept analysis (FCA) by showing how it can help construct a semantic map for a lexical typological study. We show that FCA captures typological regularities, so that concept lattices automatically built from linguistic data appear to be even more informative than traditional semantic maps. While sometimes this informativeness causes unreadab...
متن کاملCENTRALISERS OF FINITE SUBGROUPS IN SOLUBLE GROUPS OF TYPE FPn
We show that for soluble groups of type FPn, centralisers of finite subgroups need not be of type FPn.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical proceedings of the Royal Irish Academy
سال: 2022
ISSN: ['2009-0021', '1393-7197']
DOI: https://doi.org/10.1353/mpr.2022.0005